package cn.cxd.leetcode;

public class Leetcode2652 {
    public int sumOfMultiples(int n) {
        int sum = 0;
        for (int i = 3; i <= n; i++) {
            if (i % 3 == 0 || i % 5 == 0 || i % 7 ==0) {
                sum += i;
            }
        }
        return sum;
    }
}
